Communication in Bounded Depth Circuits
نویسنده
چکیده
We show that rigidity of matrices can be used to prove lower bounds on depth 2 circuits and communication graphs. We prove a general nonlinear lower bound on a certain type of circuits and thus, in particular, we determine the asymptotic size of depth d superconcentrators for all depths 4 (for even depths 4 it has been determined before).
منابع مشابه
Superpolynomial Lower Bounds for General Homogeneous Depth 4 Arithmetic Circuits
In this paper, we prove superpolynomial lower bounds for the class of homogeneous depth 4 arithmetic circuits. We give an explicit polynomial in VNP of degree n in n variables such that any homogeneous depth 4 arithmetic circuit computing it must have size n . Our results extend the works of Nisan-Wigderson [NW95] (which showed superpolynomial lower bounds for homogeneous depth 3 circuits), Gup...
متن کاملAttribute-Based Encryption for a Subclass of Circuits with Bounded Depth from Lattices
In this work, we present two Key-Policy Attribute-Based Encryption (ABE) schemes for some subclass of circuits based on the Learning with Error (LWE) assumption. Our constructions are selectively secure in the standard model. More specifically, our first construction supports a subclass of circuits with polynomially bounded depth. We call this subclass the OR-restricted circuits which means tha...
متن کاملSpace and circuit complexity of monadic second-order definable problemes on tree-decomposable structures
A famous theorem of Courcelle states that every problem that is definable in monadic second-order (mso) logic can be solved in linear time on input structures of bounded tree width. While Courcelle’s result is optimal from the algorithmic point of view, this thesis shows how to solve monadic secondorder definable decision, counting, and optimization problems on tree-widthbounded structures opti...
متن کاملAn exponential lower bound for homogeneous depth four arithmetic circuits with bounded bottom fanin
Agrawal and Vinay [AV08] have recently shown that an exponential lower bound for depth four homogeneous circuits with bottom layer of × gates having sublinear fanin translates to an exponential lower bound for a general arithmetic circuit computing the permanent. Motivated by this, we examine the complexity of computing the permanent and determinant via homogeneous depth four circuits with boun...
متن کاملThe Complexity of Computing Symmetric Functions Using Threshold Circuits
Beame, R., E. Brisson and R. Ladner, The complexity of computing symmetric functions using threshold circuits, Theoretical Computer Science 100 (1992) 2533265. This paper considers size-depth tradeoffs for threshold circuits computing symmetric functions. The size measure used is the number of connections or edges in the threshold circuits as opposed to the number of gates in the circuits. The ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Combinatorica
دوره 14 شماره
صفحات -
تاریخ انتشار 1994